A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises

We proposed a syntactic format, the panth format, for structured operational semantics in which besides ordinary transitions also predicates, negated predicates, and negat.ed transitions may occur such that if the rules are stratifiable strong bisimulation equivalence is a cOllgruence for all the operators that can be defined within the panik format.. To show that this format is useful we took soltle examples from the literature satisfying the panih format but no formats proposed by others. The examples touch upon issnes such as priorities, termina.tion, convergence, discrete time, recursion, (infinitary) Hennessy-Milner logic, and universal quantification. Collation: pp. 22, ill. 2, tab. 7, ref. 24.